The Censored Newsvendor Problem with Newsvendor Demand Distributions
نویسندگان
چکیده
We study the dynamic newsvendor problem with censored demand for both perishable and storable inventory models. We focus on the cases when demand is represented by a member of the newsvendor family of distributions. We show that the Weibull density is the only member of newsvendor distributions for which the optimal solution can be expressed in scalable form. Consequently, scalability yields sufficient dimensionality reduction so that when inventory is perishable, we can derive the optimal solution and cost in easily computable simple recursions for the Weibull demand and in explicit closed form for the exponential demand. Moreover, for the storable inventory problem with exponential demand, scalability is shown to lead to convexity and recursion for the cost function, thereby yielding efficient computation of the unique optimal solution.
منابع مشابه
The Censored Newsvendor and the Optimal Acquisition of Information
This paper investigates the e ect of demand censoring on the optimal policy in newsvendor inventory models with general parametric demand distributions and unknown parameter values. We show that the newsvendor problem with observable lost sales reduces to a sequence of single-period problems while the newsvendor problem with unobservable lost sales requires a dynamic analysis. Using a Bayesian ...
متن کاملBayesian demand updating in the lost sales newsvendor problem: A two-moment approximation
We consider Bayesian updating of demand in a lost sales newsvendor model with censored observations. In a lost sales environment, where the arrival process is not recorded, the exact demand is not observed if it exceeds the beginning stock level, resulting in censored observations. Adopting a Bayesian approach for updating the demand distribution, we develop expressions for the exact posteriors...
متن کاملComputing Optimal Policies for the Dynamic Newsvendor Problem with Censored Demand
We address the problem of computing optimal policies for a finite-horizon newsvendor model with censored demand and perishable inventory. By combining an earlyperiod optimization based grid search with easily computable late-period bounds, we are able to handle a broad range of demand distributions and prior specifications. The grid-search is performed on a discretization of the demand-decision...
متن کاملOptimal Learning Policies for the Newsvendor Problem with Censored Demand and Unobservable Lost Sales
In this paper, we consider a version of the newsvendor problem in which the demand for newspapers is unknown and the lost sales are unobservable. This problem serves as a surrogate for more complex supply chain problems in which learning plays a role. We propose the knowledge gradient (KG) policy, which considers how much is learned about the demand distribution from each order. This policy com...
متن کاملAn Adaptive, Distribution-Free Algorithm for the Newsvendor Problem with Censored Demands, with Applications to Inventory and Distribution
We consider the problem of optimizing inventories for problems where the demand distribution is unknown, and where it does not necessarily follow a standard form such as the normal. We address problems where the process of deciding the inventory, and then realizing the demand, occurs repeatedly. The only information we use is the amount of inventory left over. Rather than attempting to estimate...
متن کامل